Asymmetric Total Syntheses,Stereostructures, and Cytotoxicities of Marine Bromotriterpenoids Aplysiol B (Laurenmariannol) and Saiyacenol A

There are marine cytotoxic bromotriterpenoids, named the thyrsiferol family that are structurally characterized by some tetrahydropyran (THP) and tetrahydrofuran (THF) rings. The thyrsiferol family belongs to natural products that are often difficult to determine their stereostructures even by the current, highly advanced spectroscopic methods, especially in acyclic systems including stereogenic tetrasubstituted carbon centers. In such cases, it is effective to predict and synthesize the possible stereostructures. Herein, to elucidate ambiguous stereostructures and unassigned absolute configurations of aplysiol B, laurenmariannol, and saiyacenol A, members of the thyrsiferol family, we carried out their asymmetric chemical syntheses featuring 6-exo and 5-exo oxacyclizations of epoxy alcohol precursors and 6-endo bromoetherification of a bishomoallylic alcohol. In this paper, we report total assignments of their stereostructures through their asymmetric chemical syntheses and also their preliminary cytotoxic activities against some tumor cells. These results could not have been achieved without depending on asymmetric total synthesis.     

Normal approximation and fourth moment theorems for monochromatic triangles

Given a graph sequence denote by T₃(G_n) the number of monochromatic triangles in a uniformly random coloring of the vertices of G_n with colors. In this paper we prove a central limit theorem (CLT) for T₃(G_n) with explicit error rates, using a quantitative version of the martingale CLT. We then relate this error term to the well-known fourth-moment phenomenon, which, interestingly, holds only when the number of colors satisfies . We also show that the convergence of the fourth moment is necessary to obtain a Gaussian limit for any , which, together with the above result, implies that the fourth-moment condition characterizes the limiting normal distribution of T₃(G_n), whenever . Finally, to illustrate the promise of our approach, we include an alternative proof of the CLT for the number of monochromatic edges, which provides quantitative rates for the results obtained in [7].     

Contingent derivatives and regularization for noncoercive inverse problems

Abstract

We study the inverse problem of parameter identification in noncoercive variational problems that commonly appear in applied models. We examine the differentiability of the set-valued parameter-to-solution map using the first-order and the second-order contingent derivatives. We explore the inverse problem using the output least-squares and the modified output least-squares objectives. By regularizing the noncoercive variational problem, we obtain a single-valued regularized parameter-to-solution map and investigate its smoothness and boundedness. We also consider optimization problems using the output least-squares and the modified output least-squares objectives for the regularized variational problem. We give a complete convergence analysis showing that for the output least-squares and the modified output least-squares, the regularized minimization problems approximate the original optimization problems suitably. We also provide the first-order and the second-order adjoint method for the computation of the first-order and the second-order derivatives of the output least-squares objective. We provide discrete formulas for the gradient and the Hessian calculation and present numerical results.     

Linearly χ-bounding (P6, C4)-free graphs*

Given two graphs and , a graph is -free if it contains no induced subgraph isomorphic to or . Let and be the path on vertices and the cycle on vertices, respectively. In this paper we show that for any -free graph it holds that , where and are the chromatic number and clique number of , respectively. Our bound is attained by several graphs, for instance, the 5-cycle, the Petersen graph, the Petersen graph with an additional universal vertex, and all -critical -free graphs other than (see Hell and Huang [Discrete Appl. Math. 216 (2017), pp. 211–232]). The new result unifies previously known results on the existence of linear -binding functions for several graph classes. Our proof is based on a novel structure theorem on -free graphs that do not contain clique cutsets. Using this structure theorem we also design a polynomial time -approximation algorithm for coloring -free graphs. Our algorithm computes a coloring with colors for any -free graph in time.     

Total Synthesis of Callyspongiolide,Part 2: The Ynoate Metathesis/cis-Reduction Strategy

The macrocyclic core of the cytotoxic marine natural product callyspongiolide ( 1 ) was forged by ring-closing alkyne metathesis (RCAM) of an ynoate precursor using a molybdenum alkylidyne complex endowed with triarylsilanolate ligands as the catalyst. This result is remarkable in view of the failed attempts documented in the literature at converting electron deficient alkynes with the aid of more classical catalysts. The subsequent Z-selective semi-reduction of the resulting cycloalkyne by hydrogenation over nickel boride required careful optimization in order to minimize overreduction and competing dehalogenation of the compound's alkenyl iodide terminus as needed for final attachment of the side chain of 1 by Sonogashira coupling. The required cyclization precursor itself was prepared via Kocienski olefination.     

Efficient Syntheses of Traumatic Lactone and Rhizobialide

Herein, we report the total synthesis of traumatic lactone and rhizobialide by utilizing allenoic acid to construct the lactone ring. The key starting materials, allenoic acids, could be prepared by the ATA (allenation of terminal alkynes) of a terminal alkyne with an aldehyde that contained a protected hydroxyl group followed by hydrolysis. Importantly, the asymmetric synthesis could be realized just by replacing racemic diphenylprinol with (R)- or (S)-diphenylprinol to deliver the optically active allenoate.